A quantum approach to fully homomorphic encryption
نویسندگان
چکیده
Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of the group of unitary operations to present a private-key quantum homomorphic encryption scheme that hides arbitrary quantum computations. A particular instance of our encoding hides information at least proportional to m/ logm bits when m bits are encrypted. This highlights the potential of our protocol to hide a non-trivial amount of information, and is suggestive of a large class of encodings that might yield better security.
منابع مشابه
Quantum fully homomorphic encryption scheme based on universal quantum circuit
Fully homomorphic encryption enables arbitrary computation on encrypted data without decrypting the data. Here it is studied in the context of quantum information processing. Based on universal quantum circuit, we present a quantum fully homomorphic encryption (QFHE) scheme, which permits arbitrary quantum transformation on an encrypted data. The QFHE scheme is proved to be perfectly secure. In...
متن کاملQuantum Homomorphic Encryption for Circuits of Low T-gate Complexity
Fully homomorphic encryption is an encryption method with the property that any computation on the plaintext can be performed by a party having access to the ciphertext only. Here, we formally define and give schemes for quantum homomorphic encryption, which is the encryption of quantum information such that quantum computations can be performed given the ciphertext only. Our schemes allow for ...
متن کاملLimitations on information theoretically secure quantum homomorphic encryption
Homomorphic encryption is a form of encryption which allows computation to be carried out on the encrypted data without the need for decryption. The success of quantum approaches to related tasks in a delegated computation setting has raised the question of whether quantum mechanics may be used to achieve information theoretically secure fully homomorphic encryption. Here we show, via an inform...
متن کاملClassification of Lattice-based Fully Homomorphic Encryption from Noisy Polly Cracker*
Lattices have been used to construct many cryptographic primitives after Ajtai’s seminal paper in 1996. The goal of this paper is to design novel cryptographic primitives using lattices, which are still found to be no polynomial time attack by quantum computers. For achieving this, we survey the known lattice-based cryptography and lattice-based fully homomorphic encryption schemes as a first s...
متن کاملA Roadmap to Fully Homomorphic Elections: Stronger Security, Better Verifiability
After the trials of remote internet voting for local elections in 2011 and parliamentary elections in 2013, a number of local referendums has renewed interest in internet voting in Norway. The voting scheme used in Norway is not quantum-safe and it has limited voter verifiability. In this case study, we consider how we can use fully homomorphic encryption to construct a quantum-safe voting sche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1411.5254 شماره
صفحات -
تاریخ انتشار 2014